#include"UnorderedMap.h"
#include"UnorderedSet.h"

void set_test()
{
	unordered_set<int> us;
	for (size_t i = 0; i < 100; ++i)
	{
		us.insert(i);
	}

	auto it = us.begin();
	while (it != us.end())
	{
		cout << *it << " ";
		++it;
	}
	cout << endl;
}

int main()
{
	//CloseHash::test1();
	//LinkHash::test1();
	map_test();
	set_test();
	return 0;
}